rational subsets of finite groups
Authors
abstract
we characterize the rational subsets of a finite group and discuss the relations to integral cayley graphs.
similar resources
Rational Subsets of Finite Groups
We characterize the rational subsets of a finite group and discuss the relations to integral Cayley graphs.
full textRATIONAL CHARACTER TABLE OF SOME FINITE GROUPS
The aim of this paper is to compute the rational character tables of the dicyclic group $T_{4n}$, the groups of order $pq$ and $pqr$. Some general properties of rational character tables are also considered into account.The aim of this paper is to compute the rational character tables of the dicyclic group $T_{4n}$, the groups of order $pq$ and $pqr$. Some general properties of rational charact...
full textRational subsets of groups
This chapter is devoted to the study of rational subsets of groups, with particular em-phasis on the automata-theoretic approach to finitely generated subgroups of free groups. Indeed,Stallings’ construction, associating a finite inverse automaton with every such subgroup, inaugu-rated a complete rewriting of free group algorithmics, with connections to other fields such astopol...
full textConjugacy of Finite Subsets in Hyperbolic Groups
There is a quadratic-time algorithm that determines conjugacy between finite subsets in any torsion-free hyperbolic group. Moreover, in any k-generator, δ-hyperbolic group Γ, if two finite subsets A and B are conjugate, then x−1Ax = B for some x ∈ Γ with ‖x‖ less than a linear function of max{‖γ‖ : γ ∈ A∪B}. (The coefficients of this linear function depend only on k and δ.) These results have i...
full textSubsets of finite groups exhibiting additive regularity
In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In particular, we show that any sum set must exhibit higher-order regularity and that an abelian sum set is necessarily a reversible difference set. We next develop ...
full textMaximal subsets of pairwise non-commuting elements of some finite p-groups
Let G be a group. A subset X of G is a set of pairwise noncommuting elements if xy ̸= yx for any two distinct elements x and y in X. If |X| ≥ |Y | for any other set of pairwise non-commuting elements Y in G, then X is said to be a maximal subset of pairwise non-commuting elements. In this paper we determine the cardinality of a maximal subset of pairwise non-commuting elements in any non-abelian...
full textMy Resources
Save resource for easier access later
Journal title:
international journal of group theoryPublisher: university of isfahan
ISSN 2251-7650
volume 3
issue 2 2014
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023